Generalized translation operator and approximation in several variables
نویسنده
چکیده
Generalized translation operators for orthogonal expansions with respect to families of weight functions on the unit ball and on the standard simplex are studied. They are used to define convolution structures and modulus of smoothness for these regions, which are in turn used to characterize the best approximation by polynomials in the weighted Lp spaces. In one variable, this becomes the generalized translation operator for the Gegenbauer polynomial expansions.
منابع مشابه
Existence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملGENERALIZATION OF TITCHMARSH'S THEOREM FOR THE GENERALIZED FOURIER-BESSEL TRANSFORM
In this paper, using a generalized translation operator, we prove theestimates for the generalized Fourier-Bessel transform in the space L2 on certainclasses of functions.
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملEstimates for the Generalized Fourier-Bessel Transform in the Space L2
Some estimates are proved for the generalized Fourier-Bessel transform in the space (L^2) (alpha,n)-index certain classes of functions characterized by the generalized continuity modulus.
متن کامل